Predecessors and Successors in Random Mappings with Exchangeable In-Degrees

نویسندگان

  • Jennie C. Hansen
  • Jerzy Jaworski
چکیده

In this paper we characterise the distributions of the number of predecessors and of the number of successors of given set of vertices, A, in the random mapping model, T D̂ n , (see [10]) with exchangeable in-degree sequence (D̂1, D̂2, ..., D̂n). We show that the exact formulas for these distributions and their expected values can be given in terms of the distributions of simple functions of the in-degree variables D̂1, D̂2, ..., D̂n. As an application of these results, we consider two special examples of T D̂ n which correspond to random mappings with preferential and anti-preferential attachment, and determine the exact distributions for the number of predecessors and the number of successors in these cases. We also characterise, for these two special examples, the asymptotic behaviour of the expected numbers of predecessors and successors and interpret these results in terms of the threshold behaviour of epidemic processes on random mapping graphs. The families of discrete distributions obtained in this paper are also of independent interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random mappings with exchangeable in-degrees

A random mapping T D̂ n maps the set {1, 2, ..., n} into itself and it is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequence for the vertices is given by the variables D̂1, D̂2, ..., D̂n and, in some sense, Gn can be viewed as an analogue of the general i...

متن کامل

A new random mapping model

In this paper we introduce a new random mapping model, T D̂ n , which maps the set {1, 2, ..., n} into itself. The random mapping T D̂ n is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequence for the vertices is given by the variables D̂1, D̂2, ..., D̂n, an...

متن کامل

Local properties of a random mapping model

In this paper we investigate the ‘local’ properties of a random mapping model, T D̂ n , which maps the set {1, 2, ..., n} into itself. The random mapping T D̂ n was introduced in a companion paper [?] is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequenc...

متن کامل

On the Number of Predecessors in Constrained Random Mappings

We consider random mappings from an n–element set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and singularity analysis.

متن کامل

Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees

We study the asymptotics of the p-mapping model of random mappings on [n] as n gets large, under a large class of asymptotic regimes for the underlying distribution p. We encode these random mappings in random walks which are shown to converge to a functional of the exploration process of inhomogeneous random trees, this exploration process being derived (Aldous-Miermont-Pitman 2004) from a bri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Applied Probability

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2013